- discrete exponentiation
- дискретное возведение в степень
Англо-русский словарь по компьютерной безопасности. Академик.ру. 2011.
discrete exponentiation
Смотреть что такое "discrete exponentiation" в других словарях:
Discrete logarithm — In mathematics, specifically in abstract algebra and its applications, discrete logarithms are group theoretic analogues of ordinary logarithms. In particular, an ordinary logarithm loga(b) is a solution of the equation ax = b over the… … Wikipedia
Modular exponentiation — is a type of exponentiation performed over a modulus. It is particularly useful in computer science, especially in the field of cryptography. Doing a modular exponentiation means calculating the remainder when dividing by a positive integer m… … Wikipedia
Finite field — In abstract algebra, a finite field or Galois field (so named in honor of Évariste Galois) is a field that contains only finitely many elements. Finite fields are important in number theory, algebraic geometry, Galois theory, cryptography, and… … Wikipedia
SAFER — In cryptography, SAFER (Secure And Fast Encryption Routine) is the name of a family of block ciphers designed primarily by James Massey (one of the designers of IDEA) on behalf of Cylink Corporation. The early SAFER K and SAFER SK designs share… … Wikipedia
SEED — Infobox block cipher name = SEED designers = KISA publish date = 1998 derived from = derived to = related to = key size = 128 bits block size = 128 bits structure = Nested Feistel network rounds = 16 cryptanalysis =SEED is a block cipher… … Wikipedia
E2 (cipher) — Infobox block cipher name = E2 designers = NTT publish date = 1998 derived from = derived to = Camellia related to = key size = 128, 192, or 256 bits block size = 128 bits structure = Feistel network rounds = 12 cryptanalysis = Truncated… … Wikipedia
Zodiac (cipher) — Infobox block cipher name = Zodiac designers = Chang Hyi Lee publish date = 2000 derived from = SAFER, SHARK derived to = related to = Xenon key size = 128, 192, or 256 bits block size = 128 bits structure = Feistel network rounds = 16… … Wikipedia
Logarithm — The graph of the logarithm to base 2 crosses the x axis (horizontal axis) at 1 and passes through the points with coordinates (2, 1), (4, 2), and (8, 3) … Wikipedia
Diffie–Hellman key exchange — (D–H)[nb 1] is a specific method of exchanging keys. It is one of the earliest practical examples of key exchange implemented within the field of cryptography. The Diffie–Hellman key exchange method allows two parties that have no prior knowledge … Wikipedia
List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra … Wikipedia
Field (mathematics) — This article is about fields in algebra. For fields in geometry, see Vector field. For other uses, see Field (disambiguation). In abstract algebra, a field is a commutative ring whose nonzero elements form a group under multiplication. As such it … Wikipedia
